A Low - Delay MDCT / IMDCT
نویسنده
چکیده
© 2013 Sangkil Lee and Insung Lee 935 This letter presents an algorithm for selecting a low delay for the modified discrete cosine transform (MDCT) and inverse MDCT (IMDCT). The implementation of conventional MDCT and IMDCT requires a 50% overlap-add (OLA) for a perfect reconstruction. In the OLA process, an algorithmic delay in the frame length is employed. A reduced overlap window and MDCT/IMDCT phase shifting is used to reduce the algorithmic delay. The performance of the proposed algorithm is evaluated by applying the low-delay MDCT to the G.729.1 speech codec.
منابع مشابه
Fast IMDCT and MDCT algorithms - a matrix approach
This paper presents a systematic investigation of the modified discrete cosine transform/inverse modified discrete cosine transform (MDCT/IMDCT) algorithm using a matrix representation. This approach results in new understanding of the MDCT/IMDCT, enables the development of new algorithms, and makes clear the connection between the algorithms. We represent in a matrix form the IMDCT as the prod...
متن کاملA fast algorithm for the computation of 2-D forward and inverse MDCT
A fast algorithm for computing the two-dimensional (2-D) forward and inverse modified discrete cosine transform (MDCT and IMDCT) is proposed. The algorithm converts the 2-D MDCT and IMDCT with block size M×N into four 2-D discrete cosine transforms (DCTs) with block size (M/4)×(N/4). It is based on an algorithm recently presented by Cho [7] for the efficient calculation of one-dimensional MDCT ...
متن کاملFast and Efficient Computation of MDCT/IMDCT Algorithms for MP3 Applications
The modified discrete cosine transforms (MDCT) and its inverse (IMDCT) has become important for audio codec. MDCT/IMDCT algorithms are widely applied to realize the analysis/synthesis filter banks of the time-domain aliasing cancellation scheme for sub band coding in various audio standards. The inverse modified discrete cosine transform (IMDCT) is the most computational intensive operations in...
متن کاملMixed-radix Algorithm for the Computation of Forward and Inverse MDCT
The modified discrete cosine transform (MDCT) and inverse MDCT (IMDCT) are two of the most computational intensive operations in MPEG audio coding standards. A new mixed-radix algorithm for efficient computing the MDCT/IMDCT is presented. The proposed mixed-radix MDCT algorithm is composed of two recursive algorithms. The first algorithm, called the radix-2 decimation in frequency (DIF) algorit...
متن کاملComputation of forward and inverse MDCT using Clenshaw's recurrence formula
The forward and inverse modified discrete cosine transform (MDCT) are two of the most computational intensive operations in the MPEG audio coding standard. In this paper, we used Clenshaw’s recurrence formula to transform kernels of the MDCT and IMDCT of the general length. Efficient implementations of MDCT and IMDCT are obtained. The proposed regular structures are particularly suitable for pa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013